منابع مشابه
Estimation of matrices with row sparsity
An increasing number of applications is concerned with recovering a sparsity can be defined in terms of lq balls for q 2 [0, 2), defined as Bq(s) = { v = (vi) 2 R2 : n2 ∑
متن کاملBalanced matrices
"Dipartimento di Matematica Pura ed Applicata, Universiti di Padova, Via Belzoni 7, 35131 Padova, Italy. tCarnegie Mellon University, Schenley Park, Pittsburgh, PA 15213. ICarnegie Mellon University, Schenley Park, Pittsburgh, PA 15213. §Indian Institute of Management, Bannerghatta rd. 560076 Bangalore, India. 1 Carnegie Mellon University, Schenley Park, Pittsburgh, PA 15213. This work was supp...
متن کاملMatrices with Prescribed Row and Column Sums
This is a survey of the recent progress and open questions on the structure of the sets of 0-1 and non-negative integer matrices with prescribed row and column sums. We discuss cardinality estimates, the structure of a random matrix from the set, discrete versions of the Brunn-Minkowski inequality and the statistical dependence between row and column sums.
متن کاملOn the Maximum Row and Column Sum Norm of Gcd and Related Matrices
We estimate the maximum row and column sum norm of the n× n matrix, whose ij entry is (i, j)/[i, j], where r, s ∈ R, (i, j) is the greatest common divisor of i and j and [i, j] is the least common multiple of i and j.
متن کاملRow Products of Random Matrices
Let ∆1, . . . ,∆K be d × n matrices. We define the row product of these matrices as a d × n matrix, whose rows are entry-wise products of rows of ∆1, . . . ,∆K . This construction arises in certain computer science problems. We study the question, to which extent the spectral and geometric properties of the row product of independent random matrices resemble those properties for a d × n matrix ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1994
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)00578-f